Inter-process buffers in separation logic with rely-guarantee
نویسندگان
چکیده
منابع مشابه
A Marriage of Rely/Guarantee and Separation Logic
In the quest for tractable methods for reasoning about concurrent algorithms both rely/guarantee logic and separation logic have made great advances. They both seek to tame, or control, the complexity of concurrent interactions, but neither is the ultimate approach. Rely-guarantee copes naturally with interference, but its specifications are complex because they describe the entire state. Conve...
متن کاملUsing Locales to Define a Rely-Guarantee Temporal Logic
In this paper, we present an agent-based logic called RelyGuarantee Temporal Logic (RGTL), developed using the Isabelle theorem prover. RGTL provides a formalism for expressing complex temporallogic specifications of multi-agent systems, as well as a compositional method of reasoning about the dependencies between components in such a system. Taking advantage of Isabelle’s locale functionality,...
متن کاملOn Rely-Guarantee Reasoning
Many semantic models of rely-guarantee have been proposed in the literature. This paper proposes a new classification of the approaches into two groups based on their treatment of guarantee conditions. To allow a meaningful comparison, it constructs an abstract model for each group in a unified setting. The first model uses a weaker judgement and supports more general rules for atomic commands ...
متن کاملRely-Guarantee View Typestate
The combination of mutable state and pointer aliasing is often troublesome due to non-obvious (and usually unspecified) interferences that may occur between non-local parts of the program. We present a type-based approach to statically control aliasing and mutable state in a minimalistic single-threaded procedural language with support for structures and references. By introducing views, re-com...
متن کاملA Rely/Guarantee Reasoning Framework using Computational Tree Logic
This paper presents a formulation of a rely/guarantee reasoning framework using an extended version of computational tree logic called Relational CTL*. As a result of using Relational CTL* we gain a rely/guarantee reasoning framework which has the ability to directly reason about fairness constraints; and consider properties about the ordering and frequency of events at the level of development...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Formal Aspects of Computing
سال: 2010
ISSN: 0934-5043,1433-299X
DOI: 10.1007/s00165-009-0141-8